Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees

نویسندگان

  • Remco van der Hofstad
  • Nelly Litvak
چکیده

Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, social, and biological networks are often characterized by degreedegree dependencies between neighboring nodes. In assortative networks, the degreedegree dependencies are positive (nodes with similar degrees tend to connect to each other), whereas in disassortative networks, these dependencies are negative. One of the problems with the commonly used Pearson correlation coefficient, also known as the assortativity coefficient, is that its magnitude decreases with the network size in disassortative networks. This makes it impossible to compare mixing patterns, for example, in two web crawls of different sizes. As an alternative, we have recently suggested to use rank correlation measures, such as Spearman’s rho. Numerical experiments have confirmed that Spearman’s rho produces consistent values in graphs of different sizes but similar structure, and it is able to reveal strong (positive or negative) dependencies in large graphs. In this study we analytically investigate degree-degree dependencies for scale-free graph sequences. In order to demonstrate the ill behavior of the Pearson’s correlation coefficient, we first study a simple model of two heavy-tailed, highly correlated, Color versions of one or more of the figures in the article can be found online at www.tandfonline.com/uinm. C © Taylor & Francis Group, LLC ISSN: 1542-7951 print 287 D ow nl oa de d by [ U ni ve rs ite it T w en te ] at 0 7: 23 1 8 Se pt em be r 20 14 288 Internet Mathematics random variables X and Y , and show that the sample correlation coefficient converges in distribution either to a proper random variable on [−1, 1], or to zero, and the limit is nonnegative a.s. if X, Y ≥ 0. We next adapt these results to the degree-degree dependencies in networks as described by the Pearson correlation coefficient, and show that it is nonnegative in the large graph limit when the asymptotic degree distribution has an infinite third moment. Furthermore, we provide examples where in the Pearson’s correlation coefficient converges to zero in a network with strong negative degree-degree dependencies, and another example where this coefficient converges in distribution to a random variable. We suggest an alternative degree-degree dependency measure, based on Spearman’s rho, and prove that this statistical estimator converges to an appropriate limit under quite general conditions. These conditions are proved to be satisfied in common network models, such as the configuration model and the preferential attachment model. We conclude that rank correlations provide a suitable and informative method for uncovering network mixing patterns.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees

In network theory, Pearson’s correlation coefficients are most commonly used to measure the degree assortativity of a network. We investigate the behavior of these coefficients in the setting of directed networks with heavy-tailed degree sequences. We prove that for graphs where the inand out-degree sequences satisfy a power lawwith realistic parameters, Pearson’s correlation coefficients conve...

متن کامل

Degree-degree correlations in directed networks with heavy-tailed degrees

In network theory, Pearson’s correlation coefficients are most commonly used to measure the degree assortativity of a network. We investigate the behavior of these coefficients in the setting of directed networks with heavy-tailed degree sequences. We prove that for graphs where the inand out-degree sequences satisfy a power law, Pearson’s correlation coefficients converge to a non-negative num...

متن کامل

Degree-degree correlations in random graphs with heavy-tailed degrees

We investigate degree-degree correlations for scale-free graph sequences. The main conclusion of this paper is that the assortativity coefficient is not the appropriate way to describe degreedependences in scale-free random graphs. Indeed, we study the infinite volume limit of the assortativity coefficient, and show that this limit is always non-negative when the degrees have finite first but i...

متن کامل

Email Worm Propagation on Random Graphs

The theory of random graphs is applied to study the impact of the degree distribution on the spread of email worms. First, the idea of the email address book graph is introduced. It is shown that the structure of this graph plays a critical role in the propagation of worms. Second, convincing evidence is provided that the email address book graph has a heavy tailed degree distribution. The impl...

متن کامل

Oriented and degree-generated block models: generating and inferring communities with inhomogeneous degree distributions

The stochastic block model is a powerful tool for inferring community structure from network topology. However, it predicts a Poisson degree distribution within each community, while most real-world networks have a heavy-tailed degree distribution. The degree-corrected block model can accommodate arbitrary degree distributions within communities. But since it takes the vertex degrees as paramet...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Internet Mathematics

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2014